Action Reducts
نویسندگان
چکیده
An action is defined as controlling or changing some of attribute values in an information system to achieve desired result. An action reduct is the minimal set of attribute values distinguishing a favorable object from other objects. We use action reducts to formulate necessary actions. The action suggested by an action reduct induces changes of decision attribute values by changing the condition attribute values to the distinct patterns in action reducts.
منابع مشابه
Research on the Generalized Decision Reducts and the Acquisition of Optimal Decision Rules in Generalized Decision Information System
This paper discusses generalized decision reducts and the acquisition of optimal decision rules in general (consistent or inconsistent) decision information systems. The properties and relationship between Pawlak reducts with respect to definite information and generalized decision reducts based on indefinite information were analysed and revealed respectively. Secondly, the computation approac...
متن کاملTowards Scalable Algorithms for Discovering Rough Set Reducts
Rough set theory allows one to find reducts from a decision table, which are minimal sets of attributes preserving the required quality of classification. In this article, we propose a number of algorithms for discovering all generalized reducts (preserving generalized decisions), all possible reducts (preserving upper approximations) and certain reducts (preserving lower approximations). The n...
متن کاملDynamic Reducts and Statistical Inference
We apply rough set methods and boolean reasoning for knowledge discovery from decision tables. It is often impossible to extract general laws from experimental data by computing rst all reducts (Pawlak 1991) of a data table (decision table) and next decision rules from these reducts. We have developed an idea of dynamic reducts as a tool allowing to nd relevant reducts for the decision rule gen...
متن کاملReduct Generation in Information Systems
In any information system, the reducts are useful in classifying data. Janusz Starzyk developed an algorithm for computing reducts using strong equivalence and the law of expansion on the data. However, implementation of this algorithm is cumbersome for huge volume of data. This paper deals with a technique for obtaining the reduct of the entire system by partitioning it into two with respect t...
متن کاملDynamic Reducts as a Tool for Extracting Laws from Decisions Tables
We apply rough set methods and boolean reasoning for knowledge discovery from decision tables. It is not always possible to extract general laws from experimental data by computing rst all reducts 12] of a decision table and next decision rules on the basis of these reducts. We investigate a problem how information about the reduct set changes in a random sampling process of a given decision ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011